Optimality and duality in continuous-time nonlinear fractional programming
نویسندگان
چکیده
منابع مشابه
Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملOptimality and Duality for Minimax Fractional Semi-Infinite Programming
The purpose of this paper is to consider a class of nonsmooth minimax fractional semi-infinite programming problem. Based on the concept of H − tangent derivative, a new generalization of convexity, namely generalized uniform ( , ) H B ρ − invexity, is defined for this problem. For such semi-infinite programming problem, several sufficient optimality conditions are established and proved by uti...
متن کاملA study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
This paper is concerned with the study of necessary and sufficient optimality conditions for convex–concave generalized fractional disjunctive programming problems for which the decision set is the union of a family of convex sets. The Lagrangian function for such problems is defined and the Kuhn–Tucker Saddle and Stationary points are characterized. In addition, some important theorems related...
متن کاملOptimality Conditions and Duality in Minmax Fractional Programming, Part I: Necessary and Sufficient Optimality Conditions
The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized (F, b, φ, ρ, θ)univexity assumptions for a continuous minmax fractional programming problem involving arbitrary norms.
متن کاملDuality and optimality in multistagestochastic programming
A model of multistage stochastic programming over a scenario tree is developed in which the evolution of information states, as represented by the nodes of a scenario tree, is supplemented by a dynamical system of state vectors controlled by recourse decisions. A dual problem is obtained in which multipliers associated with the primal dynamics are price vectors that are propagated backward in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1992
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000008742